Seki Report Planning Diagonalization Proofs Planning Diagonalization Proofs
نویسنده
چکیده
This report is a rst attempt of formalizing the diagonalization proof technique. We give a strategy how to systematically construct diagonalization proofs: (i) nding an indexing relation, (ii) constructing a diagonal element, and (iii) making the implicit contradiction of the diagonal element explicit. We suggest a declarative representation of the strategy and describe how it can be realized in a proof planning environment.
منابع مشابه
Planning Diagonalization Proofs
Proof planning is a novel knowledge-based approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical eld. The diagonalization proof technique is a well-known method in theoretical computer science and in mathematics that originated with Can-tor, who used it to show his seminal uncountabili...
متن کاملThe Mechanization of the Diagonalization Proof StrategyLassaad
We present an empirical study of mathematical proofs by diagonalization, the aim is their mechanization based on proof planning techniques. We show that these proofs can be constructed according to a strategy that (i) nds an indexing relation, (ii) constructs a diagonal element, and (iii) makes the implicit contradiction of the diagonal element explicit. Moreover we suggest how diagonal element...
متن کاملSeki Report Progress in Proof Planning: Planning Limit Theorems Automatically
Proof planning is an alternative methodology to classical automated theorem proving based on exhaustive search that was rst introduced by Bundy [8]. The goal of this paper is to extend the current realm of proof planning to cope with genuinely mathematical problems such as the well-known limit theorems rst investigated for automated theorem proving by Bledsoe. The report presents a general meth...
متن کاملRepresenting and Reformulating Diagonalization Methods
Finding an appropriate representation of planning operators is crucial for theorem provers that work with proof planning. We show a new representation of operators and demonstrate how diagonalization can be represented by operators. We explain how a diagonalization operator used in one proof-plan can be analogically transferred to an operator used in another proof-plan. Finally, we nd an operat...
متن کاملUniform Diagonalization Theorem for Complexity Classes of Promise Problems including Randomized and Quantum Classes
Diagonalization in the spirit of Cantor’s diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform Diagonalization Theorem allows the construction of problems outside complexity classes while still being reducible to a specific decision problem. This paper provides a...
متن کامل